245 research outputs found

    Critical Branching Random Walks with Small Drift

    Get PDF
    We study critical branching random walks (BRWs) U(n)U^{(n)} on~Z+\mathbb{Z}_{+} where for each nn, the displacement of an offspring from its parent has drift~2β/n2\beta/\sqrt{n} towards the origin and reflection at the origin. We prove that for any~α>1\alpha>1, conditional on survival to generation~[nα][n^{\alpha}], the maximal displacement is asymptotically equivalent to (α1)/(4β)nlogn(\alpha-1)/(4\beta)\sqrt{n}\log n. We further show that for a sequence of critical BRWs with such displacement distributions, if the number of initial particles grows like~ynαyn^{\alpha} for some y>0y>0 and α>1\alpha>1, and the particles are concentrated in~[0,O(n)],[0,O(\sqrt{n})], then the measure-valued processes associated with the BRWs, under suitable scaling converge to a measure-valued process, which, at any time~t>0,t>0, distributes its mass over~R+\mathbb{R}_+ like an exponential distribution

    On the Maximal Displacement of Subcritical Branching Random Walks

    Full text link
    We study the maximal displacement of a one dimensional subcritical branching random walk initiated by a single particle at the origin. For each nN,n\in\mathbb{N}, let MnM_{n} be the rightmost position reached by the branching random walk up to generation nn. Under the assumption that the offspring distribution has a finite third moment and the jump distribution has mean zero and a finite probability generating function, we show that there exists ρ>1\rho>1 such that the function g(c,n):=\rho ^{cn} P(M_{n}\geq cn), \quad \mbox{for each }c>0 \mbox{ and } n\in\mathbb{N}, satisfies the following properties: there exist 0<δδ<0<\underline{\delta}\leq \overline{\delta} < {\infty} such that if c<δc<\underline{\delta}, then 0<lim infng(c,n)lim supng(c,n)1, 0<\liminf_{n\rightarrow\infty} g (c,n)\leq \limsup_{n\rightarrow\infty} g (c,n) {\leq 1}, while if c>δc>\overline{\delta}, then limng(c,n)=0. \lim_{n\rightarrow\infty} g (c,n)=0. Moreover, if the jump distribution has a finite right range RR, then δ<R\overline{\delta} < R. If furthermore the jump distribution is "nearly right-continuous", then there exists κ(0,1]\kappa\in (0,1] such that limng(c,n)=κ\lim_{n\rightarrow \infty}g(c,n)=\kappa for all c<δc<\underline{\delta}. We also show that the tail distribution of M:=supn0MnM:=\sup_{n\geq 0}M_{n}, namely, the rightmost position ever reached by the branching random walk, has a similar exponential decay (without the cutoff at δ\underline{\delta}). Finally, by duality, these results imply that the maximal displacement of supercritical branching random walks conditional on extinction has a similar tail behavior.Comment: 29 page

    On the estimation of integrated covariance matrices of high dimensional diffusion processes

    Full text link
    We consider the estimation of integrated covariance (ICV) matrices of high dimensional diffusion processes based on high frequency observations. We start by studying the most commonly used estimator, the realized covariance (RCV) matrix. We show that in the high dimensional case when the dimension pp and the observation frequency nn grow in the same rate, the limiting spectral distribution (LSD) of RCV depends on the covolatility process not only through the targeting ICV, but also on how the covolatility process varies in time. We establish a Mar\v{c}enko--Pastur type theorem for weighted sample covariance matrices, based on which we obtain a Mar\v{c}enko--Pastur type theorem for RCV for a class C\mathcal{C} of diffusion processes. The results explicitly demonstrate how the time variability of the covolatility process affects the LSD of RCV. We further propose an alternative estimator, the time-variation adjusted realized covariance (TVARCV) matrix. We show that for processes in class C\mathcal {C}, the TVARCV possesses the desirable property that its LSD depends solely on that of the targeting ICV through the Mar\v{c}enko--Pastur equation, and hence, in particular, the TVARCV can be used to recover the empirical spectral distribution of the ICV by using existing algorithms.Comment: Published in at http://dx.doi.org/10.1214/11-AOS939 the Annals of Statistics (http://www.imstat.org/aos/) by the Institute of Mathematical Statistics (http://www.imstat.org

    Occupation Statistics of Critical Branching Random Walks in Two or Higher Dimensions

    Full text link
    Consider a critical nearest neighbor branching random walk on the dd-dimensional integer lattice initiated by a single particle at the origin. Let GnG_{n} be the event that the branching random walk survives to generation nn. We obtain limit theorems conditional on the event GnG_{n} for a variety of occupation statistics: (1) Let VnV_{n} be the maximal number of particles at a single site at time nn. If the offspring distribution has finite α\alphath moment for some integer α2\alpha\geq 2, then in dimensions 3 and higher, Vn=Op(n1/α)V_n=O_p(n^{1/\alpha}); and if the offspring distribution has an exponentially decaying tail, then Vn=Op(logn)V_n=O_p(\log n) in dimensions 3 and higher, and Vn=Op((logn)2)V_n=O_p((\log n)^2) in dimension 2. Furthermore, if the offspring distribution is non-degenerate then P(VnδlognGn)1P(V_n\geq \delta \log n | G_{n})\to 1 for some δ>0\delta >0. (2) Let Mn(j)M_{n} (j) be the number of multiplicity-jj sites in the nnth generation, that is, sites occupied by exactly jj particles. In dimensions 3 and higher, the random variables Mn(j)/nM_{n} (j)/n converge jointly to multiples of an exponential random variable. (3) In dimension 2, the number of particles at a "typical" site (that is, at the location of a randomly chosen particle of the nnth generation) is of order Op(logn)O_p(\log n), and the number of occupied sites is Op(n/logn)O_p(n/\log n)

    Discrete Fractal Dimensions of the Ranges of Random Walks in Zd\Z^d Associate with Random Conductances

    Full text link
    Let X= {X_t, t \ge 0} be a continuous time random walk in an environment of i.i.d. random conductances {\mu_e \in [1, \infty), e \in E_d}, where E_d is the set of nonoriented nearest neighbor bonds on the Euclidean lattice Z^d and d\ge 3. Let R = {x \in Z^d: X_t = x for some t \ge 0} be the range of X. It is proved that, for almost every realization of the environment, dim_H (R) = dim_P (R) = 2 almost surely, where dim_H and dim_P denote respectively the discrete Hausdorff and packing dimension. Furthermore, given any set A \subseteq Z^d, a criterion for A to be hit by X_t for arbitrarily large t>0 is given in terms of dim_H(A). Similar results for Bouchoud's trap model in Z^d (d \ge 3) are also proven

    The random conductance model with Cauchy tails

    Full text link
    We consider a random walk in an i.i.d. Cauchy-tailed conductances environment. We obtain a quenched functional CLT for the suitably rescaled random walk, and, as a key step in the arguments, we improve the local limit theorem for pn2tω(0,y)p^{\omega}_{n^2t}(0,y) in [Ann. Probab. (2009). To appear], Theorem 5.14, to a result which gives uniform convergence for pn2tω(x,y)p^{\omega}_{n^2t}(x,y) for all x,yx,y in a ball.Comment: Published in at http://dx.doi.org/10.1214/09-AAP638 the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org

    Statistical Properties of Microstructure Noise

    Full text link
    We study the estimation of moments and joint moments of microstructure noise. Estimators of arbitrary order of (joint) moments are provided, for which we establish consistency as well as central limit theorems. In particular, we provide estimators of auto-covariances and auto-correlations of the noise. Simulation studies demonstrate excellent performance of our estimators even in the presence of jumps and irregular observation times. Empirical studies reveal (moderate) positive auto-correlation of the noise for the stocks tested
    corecore